Bounded Verification for Finite-Field-Blasting

Abstract Zero Knowledge Proofs (ZKPs) are cryptographic protocols by which a prover convinces verifier of the truth statement without revealing any other information. Typically, statements expressed in high-level language and then compiled to low-level representation on ZKP operates. Thus, bug compiler can compromise that ZK proof is supposed establish. This paper takes step towards correctness partially verifying field-blasting pass, pass translates Boolean bit-vector logic into equivalent operations finite field. First, we define for field-blasters compilers more generally. Next, describe specific field-blaster using set encoding rules verification conditions individual rules. Finally, connect definition showing if our hold, correct. We have implemented approach CirC proved bounded versions corresponding conditions. show verified does not hurt performance or its output; also report four bugs uncovered during verification.